import PrefixSum$DoublePointer.ContainerWithMostWater;
import recursive.Combinations;
import recursive.Powxn;
import recursive.Subsets;

public class ZeldaApplication {

    public static void main(String[] args){

        Powxn powxn = new Powxn();
        double x = powxn.myPow(2.00000,-2147483648);
        System.out.print(x);

//        Combinations combinations = new Combinations();
//        combinations.combine(4, 2);

//        Subsets subsets = new Subsets();
//        int[] nums = {1,2};
//        subsets.subsets(nums);

//        ContainerWithMostWater containerWithMostWater = new ContainerWithMostWater();
//        int[] heights = {1,8,6,2,5,4,8,3,7};
//        int[] heights = {2,3,4,5,18,17,6};
//        containerWithMostWater.maxArea(heights);

//        ThreeSum threeSum = new ThreeSum();
//        int[] nums = {-1,0,1,2,-1,-4};
//        int[] nums = {0,0,0,0};
//        threeSum.threeSum(nums);

//        MaximumSubarray maximumSubarray = new MaximumSubarray();
//        int[] nums = {-2,1,-3,4,-1,2,1,-5,4};
//        int[] nums = {-2,1};
//        maximumSubarray.maxSubArray(nums);

//        LRUCache lruCache = new LRUCache(2);
//        lruCache.get(2); // -1
//        lruCache.put(2, 6); // 2=6
//        lruCache.get(1); // -1
//        lruCache.put(1, 5); // 1=5, 2=6
//        lruCache.put(1, 2); // 1=2, 2=6
//        lruCache.get(1); // 2
//        lruCache.get(2); // 6

//        String[] strs = new String[]{"eat","tea","tan","ate","nat","bat"};
//        String[] strs = new String[]{""};
//        GroupAnagrams groupAnagrams = new GroupAnagrams();
//        groupAnagrams.groupAnagrams(strs);


//        MergeSortedArray mergeSortedArray = new MergeSortedArray();
//        int[] nums1 = {1,2,3,0,0,0};
//        int[] nums2 = {2,5,6};
//        mergeSortedArray.merge(nums1,3, nums2, 3);
//
//        ReverseNodesInKGroup reverseNodesInKGroup = new ReverseNodesInKGroup();
//        int k = 1;
//        ListNode head = new ListNode(1);
//        ListNode last = head;
//        while (k < 5){
//            k++;
//            ListNode next = new ListNode(k);
//            last.next = next;
//            last = next;
//        }
//        ListNode res = reverseNodesInKGroup.reverseKGroup(head, 1);
//        while (res !=null){
//            res = res.next;
//        }
    }
}
